Algorithms and complexity for Turaev–Viro invariants
نویسندگان
چکیده
منابع مشابه
Algorithms and Complexity for Turaev-Viro Invariants
The Turaev-Viro invariants are a powerful family of topological invariants for distinguishing between different 3-manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. The invariants are parameterised by an integer r ≥ 3. We resolve the question of complexity for r = 3 and r = 4, giving simple proofs that computing Turaev-Viro...
متن کاملComplexity Analysis of ATR Algorithms Based on Invariants
Recent research in the calculation and exploitation of geometric object/image relations suggests new approaches to automatic target recognition (ATR). The resulting conceptual advances have efficiently solved the geometry problem and have transformed the ATR problem into a correspondence problem. This paper provides an analysis of the elementary algorithms which exploit object/image relations a...
متن کاملQuantum algorithms for invariants of triangulated manifolds
Abstract. One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor networks. The graph underlying these networks is given by the triangulation of a manifold, and the structure of the tensors ensures that the overall ten...
متن کاملAlgorithms for orbit closure separation for invariants and semi-invariants of matrices
We consider two group actions on m-tuples of n × n matrices. The first is simultaneous conjugation by GLn and the second is the left-right action of SLn × SLn. We give efficient algorithms to decide if the orbit closures of two points intersect. We also improve the known bounds for the degree of separating invariants in these cases.
متن کاملcalculation of computational complexity for radix-2p fast fourier transform algorithms for medical signals
due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied and Computational Topology
سال: 2018
ISSN: 2367-1726,2367-1734
DOI: 10.1007/s41468-018-0016-2